1624C - Division by Two and Permutation - CodeForces Solution

constructive algorithms flows graph matchings greedy math *1100

Please click on ads to support us..

Python Code: 

for _ in range(int(input())):
    n=int(input())
    c=[0]*99
    for v in map(int,input().split()):
        while v>n:v//=2
        c[v]+=1
    for i in range(n,0,-1):
        if c[i]:
            c[i//2]+=c[i]-1
        else:
            break
    else:
        print('YES')
        continue
    print('NO')

C++ Code: 

#include<bits/stdc++.h>
using namespace std;
int t,n,a[55],x;
int main(){
cin>>t;
while(t--){
cin>>n;
for(int i=0;i<=54;i++)
a[i]=0;
for(int i=1;i<=n;i++){
cin>>x;
while(x>n)
x=x/2;
while(a[x] and x>0)
x=x/2;
a[x]=1;
}
if(a[0])
cout<<"NO"<<endl;
else
cout<<"YES"<<endl;
}
return 0;
}


Comments

Submit
0 Comments
More Questions

1657C - Bracket Sequence Deletion
1657B - XY Sequence
1009A - Game Shopping
1657A - Integer Moves
230B - T-primes
630A - Again Twenty Five
1234D - Distinct Characters Queries
1183A - Nearest Interesting Number
1009E - Intercity Travelling
1637B - MEX and Array
224A - Parallelepiped
964A - Splits
1615A - Closing The Gap
4C - Registration System
1321A - Contest for Robots
1451A - Subtract or Divide
1B - Spreadsheet
1177A - Digits Sequence (Easy Edition)
1579A - Casimir's String Solitaire
287B - Pipeline
510A - Fox And Snake
1520B - Ordinary Numbers
1624A - Plus One on the Subset
350A - TL
1487A - Arena
1520D - Same Differences
376A - Lever
1305A - Kuroni and the Gifts
1609A - Divide and Multiply
149B - Martian Clock